Iterative refinement for symmetric eigenvalue decomposition
نویسندگان
چکیده
منابع مشابه
Parallel iterative refinement in polynomial eigenvalue problems
Methods for the polynomial eigenvalue problem sometimes need to be followed by an iterative refinement process to improve the accuracy of the computed solutions. This can be accomplished by means of a Newton iteration tailored to matrix polynomials. The computational cost of this step is usually higher than the cost of computing the initial approximations, due to the need of solving multiple li...
متن کاملBlind source separation via symmetric eigenvalue decomposition
We propose a new sufficient condition for separation of colored source signals with temporal structure, stating that the separation is possible, if the source signals have different higher self-correlation functions of even order. We show that the problem of blind source separation of uncorrelated colored signals can be converted to a symmetric eigenvalue problem of a special covariance matrix ...
متن کاملOn convergence of iterative projection methods for symmetric eigenvalue problems
We prove global convergence of particular iterative projection methods using the so-called shift-and-invert technique for solving symmetric generalized eigenvalue problems. In particular, we aim to provide a variant of the convergence theorem obtained by Crouzeix, Philippe, and Sadkane for the generalized Davidson method. Our result covers the Jacobi-Davidson and the rational Krylov methods wit...
متن کاملA blocked QR-decomposition for the parallel symmetric eigenvalue problem
In this paper we present a new stable algorithm for the parallel QR-decomposition of ”tall and skinny” matrices. The algorithm has been developed for the dense symmetric eigensolver ELPA, whereat the QR-decomposition of tall and skinny matrices represents an important substep. Our new approach is based on the fast but unstable CholeskyQR algorithm [1]. We show the stability of our new algorithm...
متن کاملLU-Decomposition with Iterative Refinement for Solving Sparse Linear Systems
In the solution of a system of linear algebraic equations Ax = b with a large sparse coefficient matrix A, the LU-decomposition with iterative refinement (LUIR) is compared with the LU-decomposition with direct solution (LUDS), which is without iterative refinement. We verify by numerical experiments that the use of sparse matrix techniques with LUIR may result in a reduction of both the comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japan Journal of Industrial and Applied Mathematics
سال: 2018
ISSN: 0916-7005,1868-937X
DOI: 10.1007/s13160-018-0310-3